1/6
2/6
3/6
b=
0
1
j=0
k=0
150
2
38
188
4
76
226
6
114
14
8
152
52
10
190
90
18
128
56
166
94
204
132
32
20
170
70
208
108
8
146
46
184
84
222
30
122
10
160
48
198
86
28
124
66
162
40
104
200
142
30
180
68
218
106
4
144
50
42
182
80
220
118
6
156
44
194
82
60
22
120
60
158
98
196
136
24
174
62
70
212
100
12
138
50
176
88
214
126
2
80
164
40
202
78
34
116
72
154
110
192
90
148
26
186
64
224
102
16
140
54
178
100
92
216
130
20
168
58
206
96
36
134
110
74
172
112
112
210
2
3
i=l
k=1
151
3
39
189
5
77
227
7
115
15
9
153
53
11
191
91
19
129
57
167
95
205
133
33
21
171
71
209
109
9
147
47
185
85
223
31
123
11
161
49
199
87
29
125
67
163
41
105
201
143
31
181
69
219
107
5
145
51
43
183
81
221
119
7
157
45
195
83
61
23
121
61
159
99
197
137
25
175
63
71
213
101
13
139
51
177
89
215
127
3
81
165
41
203
79
35
117
73
155
111
193
91
149
27
187
65
225
103
17
141
55
179
101
93
217
131
21
169
59
207
97
37
135
111
75
173
113
113
211
. 3
4/6
store a set of offset values in at least one table.
SL
Apply in order each of the set of offset values to
identify an adjacent bit pair in the first sequence
of the bits for a new interleaved sequence of the
bits.
Increment each of the set of offset values until an
upper limit is reached to further identify additional
adjacent bit pairs in the first sequence of the bits
for the new interleaved sequence of the bits.
FIG. 5
6/6
Live Music Archive
Librivox Free Audio
Metropolitan Museum
Cleveland Museum of Art
Internet Arcade
Console Living Room
Books to Borrow
Open Library
TV News
Understanding 9/11